Fast perfect sampling from linear extensions
نویسندگان
چکیده
منابع مشابه
Fast perfect sampling from linear extensions
In this paper, we study the problem of sampling (exactly) uniformly from the set of linear extensions of an arbitrary partial order. Previous Markov chain techniques have yielded algorithms that generate approximately uniform samples. Here, we create a bounding chain for one such Markov chain, and by using a non-Markovian coupling together with a modified form of coupling from the past, we buil...
متن کاملFast MCMC sampling for Markov jump processes and extensions
Markov jump processes (or continuous-time Markov chains) are a simple and important class of continuous-time dynamical systems. In this paper, we tackle the problem of simulating from the posterior distribution over paths in these models, given partial and noisy observations. Our approach is an auxiliary variable Gibbs sampler, and is based on the idea of uniformization. This sets up a Markov c...
متن کاملEntropic Uniform Sampling of Linear Extensions in Series-Parallel Posets
In this paper, we introduce a uniform random sampler for linear extensions of Series-Parallel posets. The algorithms we present ensure an essential property of random generation algorithms: entropy. They are in a sense optimal in their consumption of random bits.
متن کاملPerfect Subgroups of Hnn Extensions
This note includes supporting material for Guilbault’s one-hour talk summarized elsewhere in these proceedings. We supply the group theory necessary to argue that Guilbault’s tame ends cannot be pseudocollared. In particular, we show that certain groups (the interated Baumslag-Solitar groups) cannot have any non-trivial perfect subgroups. The absence of non-trivial perfect subgroups, in turn, e...
متن کاملQuasi-perfect linear codes from plane cubics
We present some recently obtained constructions of linear quasi-perfect codes with small density arising from plane cubic curves.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2006
ISSN: 0012-365X
DOI: 10.1016/j.disc.2006.01.003